| 1. | Solving the multiple sequence alignment problem based on simulated annealing algorithm
多序列联配问题的模拟退火求解 |
| 2. | Among these tools , multiple sequence alignment ( msa ) is the most important because msa is central to most bioinformatics techniques
因为其它的许多生信息学工具都是以多序列对齐为基础的。 |
| 3. | We have identified six conserved domains by multiple sequence alignments of the thymidine kinase proteins of the alphaherpesviruses
通过对疱疹病毒tk氨基酸进行多序列比较，我们获得了在prvtk氨基酸序列上的六个保守区间。 |
| 4. | Pfam is a large collection of multiple sequence alignments and hidden markov models covering many common protein families
为一包含了许多多重序列校准，以及“隐藏式马尔科夫模型”的巨大集合，里面涵盖了许多常见的蛋白质家族。 |
| 5. | Due to the np - completeness of optimal msa , any attempt of developing a fast algorithm to compute optimal multiple sequence alignments is expected to fail
由于序列对齐是一个np完全问题，所有企图快速产生最优化对齐的想法是不可能实现的。 |
| 6. | Completion of multiple sequences is allowed . of course , completing a sequence may trigger the completion of one or more other sequences and yield a corresponding bonus
被允许的多个序列完成。当然，完成序列也许触发一个或更多其它序列的完成和对应的分数。 |
| 7. | Pairwise and multiple sequence alignment algorithms of bioinformaics are studied in this paper . the main contents and production can be briefly summarized as follows : 1
本文研究了生物信息学中的双序列和多序列比对算法，主要研究内容和取得的成果如下： 1 |
| 8. | In this paper , we analysis the information of nucleotide or amino acid sequences with computer technology and finally give a computation result which is an alignment of either pair - wise sequences or multiple sequences of nucleotide acid or amino acid
本文通过计算机技术，对于核苷酸或氨基酸中的信息进行分析，针对两个或者两个以上的核苷酸序列或氨基酸序列，经过计算，最终给出比对结果。 |
| 9. | 5 . in biology field , clustal is one of the most popular multiple sequence alignment software . when large numbers of sequences are aligned at one time , the time complexity of clustal algorithm is very big and it is not suit for vast sequences
Clustal程序是生物学界通用的多序列比对软件之一，随着同时进行比对的序列数据量的增加，其时间复杂度急剧增加，该程序无法满足大规模的序列数据比对。 |
| 10. | This paper is devoted to investigating the capability of aco metaheuristic for solving mcp and proposes an intensification - diversification balanced aco algorithm for mcp . moreover , the algorithm is applied to improving the progressive algorithm which is for multiple sequences alignment problem ( msa )
鉴于此,本文对蚁群优化算法解决最大团问题的能力进行了研究,提出一个解决最大团问题的intensification和diversification平衡协作的蚁群优化算法。 |
